Defective coloring revisited
نویسندگان
چکیده
منابع مشابه
Defective coloring revisited
A graph is (k, d)-colorable if one can color the vertices with k colors such that no vertex is adjacent to more than d vertices of its same color. In this paper we investigate the existence of such colorings in surfaces and the complexity of coloring problems. It is shown that a toroidal graph is (3, 2)and (5, 1)-colorable, and that a graph of genus γ is (χγ/(d + 1) + 4, d)-colorable, where χγ ...
متن کاملParameterized (Approximate) Defective Coloring
In Defective Coloring we are given a graph G = (V,E) and two integers χd,∆ and are asked if we can partition V into χd color classes, so that each class induces a graph of maximum degree ∆∗. We investigate the complexity of this generalization of Coloring with respect to several well-studied graph parameters, and show that the problem is W-hard parameterized by treewidth, pathwidth, tree-depth,...
متن کاملDefective circular coloring
The concept of a defective circular coloring is introduced, and results shown for planar, series-parallel, and outerplanar graphs. Numerous problems are also stated.
متن کاملH-Coloring dichotomy revisited
The H-Coloring problem can be expressed as a particular case of the Constraint Satisfaction Problem (CSP) whose computational complexity has been intensively studied under various approaches in the last several years. We show that the dichotomy theorem proved by P.Hell and J.Nešetřil [12] for the complexity of the H-Coloring problem for undirected graphs can be obtained using general methods fo...
متن کاملGraph Coloring in Optimization Revisited
Algorithms for solving numerical optimization problems and nonlinear systems of equations that rely on derivative information require the repeated estimation of Jacobian and Hessian matrices. The problem of minimizing the number of function evaluations needed to estimate the derivative matrices, within a finite difference method or an automatic differentiation method, has been formulated as a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 1997
ISSN: 0364-9024,1097-0118
DOI: 10.1002/(sici)1097-0118(199703)24:3<205::aid-jgt2>3.0.co;2-t